Generalised voltage graphs
نویسندگان
چکیده
A graph with a semiregular group of automorphisms can be thought as the derived cover arising from voltage graph. Since its inception, theory graphs and their covers has been powerful tool used in study significant degree symmetry. We generalise this to that is not necessarily semiregular, we several well-known results classical broader setting.
منابع مشابه
Generalised colouring sums of graphs
The notion of the b-chromatic number of a graph attracted much research interests and recently a new concept, namely the b-chromatic sum of a graph, denoted by (G), has also been introduced. Motivated by the studies on b-chromatic sum of graphs, in this paper we introduce certain new parameters such as -chromatic sum, -chromatic sum, b-chromatic sum, -chromatic sum and -chromatic sum of graphs....
متن کاملGeneralised game colouring of graphs
We consider the version of a colouring game introduced by Bodlaender [On the complexity of some colorings games, Internat. J. Found. Comput. Sci. 2 (1991) 133–147]. We combine the concepts: this game and the generalised colouring of graphs as follows. The two players are Alice and Bob and they play alternatively with Alice having the first move. Let be given a graph G and an ordered set of here...
متن کاملRecognition of unipolar and generalised split graphs
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the clique number, the stability number, the chromatic number, and to solve other problems that are hard for general graphs. We present an O(n)-time algorithm for ...
متن کاملJacobsthal numbers in generalised Petersen graphs
We prove that the number of 1-factorisations of a generalised Petersen graph of the type GP (3k, k) is equal to the kth Jacobsthal number J(k) if k is odd, and equal to 4J(k), when k is even. Moreover, we verify the list colouring conjecture for GP (3k, k).
متن کاملCompact Routing Schemes for Generalised Chordal Graphs
In this paper, we show how to use the notion of layering-tree introduced in [5], in order to obtain polynomial time constructible routing schemes. We describe efficient routing schemes for two classes of graphs that include the class of chordal graphs. For k-chordal graphs, i.e., graphs containing no induced cycle of length greater than k, the routing scheme uses addresses and local memories of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2021
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2021.103313